Pfaffian ideals of ladders

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating the Pfaffian closure with total Pfaffian functions

Given an o-minimal expansion R of the real field, we show that the structure obtained from R by iterating the operation of adding all total Pfaffian functions over R defines the same sets as the Pfaffian closure of R . 2010 Mathematics Subject Classification 14P10,03C64 (primary); 58A17 (secondary)

متن کامل

α-Pfaffian, pfaffian point process and shifted Schur measure

For any complex number α and any even-size skew-symmetric matrix B, we define a generalization pf α (B) of the pfaffian pf(B) which we call the α-pfaffian. The α-pfaffian is a pfaffian analogue of the α-determinant studied in [ST] and [V]. It gives the pfaffian at α = −1. We give some formulas for α-pfaffians and study the positivity. Further we define point processes determined by the α-pfaffi...

متن کامل

The Pfaffian Transformation

We then define the Pfaffian transformation of (a0, a1, a2, ...) to be the sequence of Pfaffians (Pf(A0), P f(A1), P f(A2), ...), where the Pfaffian of a skew-symmetric matrix is the positive or negative square root of its determinant. (For a precise definition of the Pfaffian, see section 2.) The Pfaffian transformation is thus a function from sequences to sequences. We begin by observing the e...

متن کامل

Pfaffian Circuits

It remains an open question whether the apparent additional power of quantum computation derives inherently from quantum mechanics, or merely from the flexibility obtained by “lifting” Boolean functions to linear operators and evaluating their composition cleverly. Holographic algorithms provide a useful avenue for exploring this question. We describe a new, simplified construction of holograph...

متن کامل

The optimal rubbling number of ladders, prisms and Möbius-ladders

A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move, one pebble each is removed at vertices v and w adjacent to a vertex u, and an extra pebble is added at vertex u. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 1998

ISSN: 0022-4049

DOI: 10.1016/s0022-4049(96)00125-9